Proof Assistant Decision Procedures for Formalizing Origami
نویسندگان
چکیده
Origami constructions have interesting properties that are not covered by standard euclidean geometry. Such properties have been shown with the help of computer algebra systems. Proofs performed with computer algebra systems can be accompanied by proof documents, still they lack complete mathematical rigorousity, like the one provided by proof assistant checked proofs. Transforming such proofs to machine checkable proof scripts poses a number of challenges. In this paper we describe issues that arise when proving properties of origami constructions using proof assistant decision procedures. We examine the strength of Gröbner Bases implementations comparing proof assistants with each other and with the implementations provided in computer algebra systems. We show ad-hoc decision procedures that can be used to optimize the proofs. We show how maximum equilateral triangle inscribed in a square construction can be formalized. We show how a equation system solving mechanism can be embedded in a CAS decision procedure of a proof assistant.
منابع مشابه
Formalizing Symbolic Decision Procedures for Regular Languages
This thesis studies decision procedures for the equivalence of regular languages represented symbolically as regular expressions or logical formulas. Traditional decision procedures in this context rush to dispose of the concise symbolic representation by translating it into finite automata, which then are efficiently minimized and checked for structural equality. We develop procedures that avo...
متن کاملIntegration of Decision Procedures into High - Order Interactive
INTEGRATION OF DECISION PROCEDURES INTO HIGH-ORDER INTERACTIVE PROVERS by Yegor Bryukhov Adviser: Professor Sergei Artemov An efficient proof assistant uses a wide range of decision procedures, including automatic verification of validity of arithmetical formulas with linear terms. Since the final product of a proof assistant is a formalized and verified proof, it prompts an additional task of ...
متن کاملFormalizing O Notation in Isabelle/HOL
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
متن کاملFormalizing Semantics with an Automatic Program Verifier
A common belief is that formalizing semantics of programming languages requires the use of a proof assistant providing (1) a specification language with advanced features such as higher-order logic, inductive definitions, type polymorphism, and (2) a corresponding proof environment where higher-order and inductive reasoning can be performed, typically with user interaction. In this paper we sho...
متن کاملFormalizing Rigorous Hilbert Axiomatic Geometry Proofs in the Proof Assistant Hol Light
This note is intended to be useful to good high school students wanting a rigorous treatment of Hilbert’s axioms for plane geometry.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011